package graph;

import java.util.Comparator;


public class Edges {
	public Edges(EdgesImplFactory impl){
	}
	
	public static class EdgeId {
		EdgeId(int srcId, int desId) {
			m_srcId = srcId;
			m_desId = desId;
		}

		int m_srcId;
		int m_desId;
	}

	public static class EdgeIdComp implements Comparator<EdgeId> {
		public int compare(EdgeId o1, EdgeId o2) {
			if (o1.m_desId < o2.m_desId) {
				return -1;
			} else if (o1.m_desId == o2.m_desId && o1.m_srcId < o2.m_srcId) {
				return -1;
			} else if (o1.m_desId == o2.m_desId && o1.m_srcId == o2.m_srcId) {
				return 0;
			} else {
				return 1;
			}
		}
	}
	
}
